Action Planning & General Game Playing for Robots

نویسنده

  • Stefan Edelkamp
چکیده

One of the oldest dreams in the research area of Artificial Intelligence is the design of autonomous robots with problem-solving ability comparable to that of humans. Beginning of the 70's was the Stanford Research Institute Planning System STRIPS (Fikes & Nilsson, 1971). Its formalism for the description of action planning domains is fundamental. STRIPS is motivated by mapping plans to robots, and SHAKEY (Nilsson, 1984) was one of the first robots, who offered its services based on STRIPS. Planning operators divide into preconditions and effects, and provide an inference mechanism wrt. a logical description of start and goal state. Of-the-shelf planners then generate a sequence of actions. STRIPS has been modified over the years into other description languages, such as the Planning Domain Definition Language PDDL (McDermott, 2000, Fox & Long 2003). Parallel to this was the design of the Game Description Language (GDL). Investigations show: many planning problems can be described in GDL, as well as many GDL-specified games have a PDDL-like equivalent. Regardless of the vision for the planning-based robotics, researchers have problems to port "classical" approaches to a service robot, e.g., to perform household work, due to various reasons: the discrepancy of the state of the world from its internal representation; the difference of the work and configuration space (with its many degrees of freedom); dealing with the faulty execution of plans; many plans are "paranoid": all uncertainties are interpreted in a worst-case scenario; the lack of a learning process for continuous improvement of plans; the need for reactive control, i.e., the adaption of plans to the environment; the requirement for planning in real time; the discrepancy between the discrete and continuous representations; the inaccuracy and diversity of different sensors; the inherent incompleteness of information; the fixed execution units in the robot control; the complexity of the inference based on trajectories, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Execution Monitoring as Meta-Games for General Game-Playing Robots

General Game Playing aims to create AI systems that can understand the rules of new games and learn to play them effectively without human intervention. The recent proposal for general game-playing robots extends this to AI systems that play games in the real world. Execution monitoring becomes a necessity when moving from a virtual to a physical environment, because in reality actions may not ...

متن کامل

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Simulation of Action Theories and an Application to General Game-Playing Robots

We consider the problem of verifying whether one action theory can simulate a second one. Action theories provide modular descriptions of state machines, and simulation means that all possible sequences of actions in one transition system can be matched by the other. We show how Answer Set Programming can be used to automatically prove simulation by induction from an axiomatisation of two actio...

متن کامل

The International General Game Playing Competition

games based solely on formal game descriptions supplied at run time. (In other words, they don’t know the rules until the game starts.) Unlike specialized game players, such as Deep Blue (Campbell, Hoane, and Hsu 2002), general game players cannot rely on algorithms designed in advance for specific games; they must discover such algorithms themselves. General game playing expertise depends on i...

متن کامل

Monte-Carlo Exploration for Deterministic Planning

Search methods based on Monte-Carlo simulation have recently led to breakthrough performance improvements in difficult game-playing domains such as Go and General Game Playing. Monte-Carlo Random Walk (MRW) planning applies MonteCarlo ideas to deterministic classical planning. In the forward chaining planner ARVAND, MonteCarlo random walks are used to explore the local neighborhood of a search ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013